#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<vector>
#include<unordered_map>
using namespace std;
class Solution {
public:
    int searchInsert(vector<int>& nums, int target)
    {
        int left = 0;
        int right = nums.size() - 1;
        while (left < right)
        {
            int mid = left + (right - left) / 2;
            if (nums[mid] < target)
            {
                left = mid + 1;
            }
            else
            {
                right = mid;
            }
        }
        if (nums[left] < target)return left + 1;
        return  left;
    }
};

int main()
{
    int nums[] = { 1,3,5,6 };
    vector <int> m;
    for (auto& e : nums)m.push_back(e);
    Solution s;
    cout << s.searchInsert(m, 7) << endl;
    return 0;
}